منابع مشابه
Double - Pullback Transitions
The aim of this paper is an extension of the theory of graph transformation systems in order to make them suitable for the speciication of reactive systems. For this purpose two main extensions of the algebraic theory of graph transformations are proposed. Firstly, graph transitions are introduced as a loose interpretation of graph productions, deened using a double pullback construction in con...
متن کاملA Tractable Scheme Implementation
Scheme 48 is an implementation of the Scheme programming language constructed with tractability and reliability as its primary design goals. It has the structural properties of large, compiler-based Lisp implementations: it is written entirely in Scheme, is bootstrapped via its compiler, and provides numerous language extensions. It controls the complexity that ordinarily attends such large Lis...
متن کاملLearning pullback HMM manifolds
Recent work in action recognition has exposed the limitations of methods which directly classify local features extracted from spatio-temporal video volumes. In opposition, encoding the actions’ dynamics via generative dynamical models has a number of desirable features when it comes to unsupervised learning of plots, crowd monitoring, and description of more complex activities. However, using ...
متن کاملNet Refinement by Pullback Rewriting
The notion of pullback rewriting has been developed recently as a category theoretical framework for vertex replacement in graphs. Here, the technique is presented based on net morphisms, yielding a well-deened mechanism which is closely related to pullback rewriting in hypergraphs. Finally, a net reenement operation modifying the context of the reened transition is characterized in terms of pu...
متن کاملTRACTABLE SCHEME IMPLEMENTATION 3 Dialect Use within Scheme 48 Pre - Scheme Virtual machine implementationPrimitive Scheme
Scheme 48 is an implementation of the Scheme programming language constructed with tractability and reliability as its primary design goals. It has the structural properties of large, compiler-based Lisp implementations: it is written entirely in Scheme, is bootstrapped via its compiler, and provides numerous language extensions. It controls the complexity that ordinarily attends such large Lis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Physics Communications
سال: 2019
ISSN: 0010-4655
DOI: 10.1016/j.cpc.2018.12.002